Longest increasing subsequence - PDFSEARCH.IO - Document Search Engine

Longest increasing subsequence
Results: 26

#	Item
11	PDF Document Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:15 Analysis of algorithms Computational complexity theory Operations research Dynamic programming Algorithms Sorting algorithm Randomized algorithm Longest increasing subsequence Time complexity Theoretical computer science Applied mathematics Mathematics
12	Faster Algorithms for Computing Longest Common Increasing Subsequences Gerth Stølting Brodal Kanela Kaligosi Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2006-07-07 08:09:04 Formal languages Longest increasing subsequence Subsequence Longest common subsequence problem Ordinal number Ordinal arithmetic Mathematics Dynamic programming Combinatorics
13	Subsequence Combinatorics and Applications Sven Rahmann Algorithms and Statistics for Systems Biology Group Genome Informatics, Department of Technology, Bielefeld University, Germany CPM’06, Barcelona, Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2006-07-05 09:33:34 String Substring Subsequence Sequence Dynamic programming Discrete geometry Longest increasing subsequence Mathematics Elementary mathematics Combinatorics
14	CS 373 Homework 1 (dueSpring 1999 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:08 Operations research Dynamic programming Analysis of algorithms Algorithm Mathematical logic Longest increasing subsequence Sorting algorithm Time complexity Greedy algorithm Mathematics Theoretical computer science Applied mathematics
15	16th Canadian Conference on Computational Geometry, 2004 ´ any’s ´ A Stronger Version of Bar Theorem in the Plane Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Triangles Subsequence Triangle Dynamic programming Combinatorics Longest increasing subsequence Geometry Mathematics Triangle geometry
16	Limitations of Incremental Dynamic Programming Stasys Jukna Abstract We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The classical Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2013-04-23 13:36:27 Operations research Dynamic programming NP-complete problems Mathematical optimization Combinatorics Algorithm Greedy algorithm Knapsack problem Longest increasing subsequence Mathematics Theoretical computer science Applied mathematics
17	4.2 The Erd˝ os–Szekeres theorem 39 We will be interested in the length of the longest increasing and decreasing Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:28 Elementary mathematics Dynamic programming Formal languages Longest increasing subsequence Subsequence Sequence Erdős–Szekeres theorem Mathematics Discrete mathematics Combinatorics
18	SOI 2013 The Swiss Olympiad in Informatics Perfect solution Add to Reading List Source URL: www.soi.ch Language: English - Date: 2012-09-30 17:37:36 Analysis of algorithms Computational complexity theory Dynamic programming Algorithm Time complexity Big O notation Longest increasing subsequence CYK algorithm Theoretical computer science Mathematics Applied mathematics
19	August 2014 • Volume 7 • Number 6 To Foster and Nurture Girls’ Interest in Mathematics An Interview with Christine Berkesch Zamaere Summer Fun Solutions: Solutions: Add to Reading List Source URL: www.girlsangle.org Language: English - Date: 2014-09-01 11:13:49 Applied mathematics Algorithm Mathematical logic Theoretical computer science Permutation Longest increasing subsequence Mathematics Combinatorics Dynamic programming
20	Index Interpolation: An Approach to Subsequence Matching Supporting Normalization Transform in Time-Series Databases Woong-Kee Lohy, Sang-Wook Kimz, and Kyu-Young Whangy y Department of Electrical Engineering & Computer Add to Reading List Source URL: dblab.kaist.ac.kr Language: English - Date: 2009-06-10 22:36:48 Dynamic programming Digital signal processing Discrete cosine transform Fourier analysis Subsequence Search engine indexing Longest increasing subsequence Levenshtein distance Mathematics Information science Mathematical analysis